Removal and contraction operations to define combinatorial pyramids: application to the design of a spatial modeler

نویسندگان

  • Guillaume Damiand
  • Martine Dexet
  • Pascal Lienhardt
  • Eric Andres
چکیده

Removal and contraction are basic operations for several methods conceived in order to handle irregular image pyramids, for multi-level image analysis for instance. We give the definitions of removal and contraction operations in the generalized maps framework. We propose a first experimentation of irregular pyramid as a basis for a discrete geometrical modeler that can handle both discrete and continuous representations of geometrical objects. This modeler is based on a pyramidal kernel with four coexisting levels between the discrete and the Euclidean representations. We describe how this pyramid can be constructed and updated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Removal and Contraction for n-Dimensional Generalized Maps

Removal and contraction are basic operations for several methods conceived in order to handle irregular image pyramids, for multi-level image analysis for instance. Such methods are often based upon graph-like representations which do not maintain all topological information, even for 2-dimensional images. We study the definitions of removal and contraction operations in the generalized maps fr...

متن کامل

nD generalized map pyramids: Definition, representations and basic operations

Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more topological information than graph pyramids. The main contribution of this work is the definition of pyramids of n-dimensional generalized maps. This extends the previous works to any dimension, and generalizes them in ...

متن کامل

Insertion and Expansion Operations for n -Dimensional Generalized Maps

Hierarchical representations, such as irregular pyramids, are the bases of several applications in the field of discrete imagery. So, ndimensional ”bottom-up” irregular pyramids can be defined as stacks of successively reduced n-dimensional generalized maps (n-G-maps) [11], each n-G-map being defined from the previous level by using removal and contraction operations defined in [8]. Our goal is...

متن کامل

Rooted Kernels and Labeled Combinatorial Pyramids

An irregular pyramid consists of a stack of successively reduced graphs. Each smaller graph is deduced from the preceding one using contraction or removal kernels. A contraction (resp. removal) kernel defines a forest of the initial (resp. dual ) graph, each tree of this forest being reduced to a single vertex (resp. dual vertex) in the reduced graph. A combinatorial map encodes a planar graph ...

متن کامل

A First Step toward Combinatorial Pyramids in n-D Spaces

Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of the objects (either shapes or partitions). Combinatorial pyramids have first be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2005